找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithms, Concurrency and Knowledge; 1995 Asian Computing Kanchana Kanchanasut,Jean-Jacques Lévy Conference proceedings 1995 Springer-Ver

[复制链接]
查看: 43982|回复: 58
发表于 2025-3-21 19:03:50 | 显示全部楼层 |阅读模式
期刊全称Algorithms, Concurrency and Knowledge
期刊简称1995 Asian Computing
影响因子2023Kanchana Kanchanasut,Jean-Jacques Lévy
视频video
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Algorithms, Concurrency and Knowledge; 1995 Asian Computing Kanchana Kanchanasut,Jean-Jacques Lévy Conference proceedings 1995 Springer-Ver
影响因子This volume constitutes the refereed proceedings of the 1995 Asian Computing Science Conference, ACSC 95, held in Pathumthani, Thailand in December 1995..The 29 fully revised papers presented were selected from a total of 102 submissions; clearly the majority of the participating researchers come from South-East Asian countries, but there is also a strong international component. The volume reflects research activities, particularly by Asian computer science researchers, in different areas. Special attention is paid to algorithms, knowledge representation, programming and specification languages, verification, concurrency, networking and distributed systems, and databases.
Pindex Conference proceedings 1995
The information of publication is updating

书目名称Algorithms, Concurrency and Knowledge影响因子(影响力)




书目名称Algorithms, Concurrency and Knowledge影响因子(影响力)学科排名




书目名称Algorithms, Concurrency and Knowledge网络公开度




书目名称Algorithms, Concurrency and Knowledge网络公开度学科排名




书目名称Algorithms, Concurrency and Knowledge被引频次




书目名称Algorithms, Concurrency and Knowledge被引频次学科排名




书目名称Algorithms, Concurrency and Knowledge年度引用




书目名称Algorithms, Concurrency and Knowledge年度引用学科排名




书目名称Algorithms, Concurrency and Knowledge读者反馈




书目名称Algorithms, Concurrency and Knowledge读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:42:06 | 显示全部楼层
发表于 2025-3-22 03:12:50 | 显示全部楼层
发表于 2025-3-22 07:14:18 | 显示全部楼层
发表于 2025-3-22 10:36:14 | 显示全部楼层
Zusammenfassung, Diskussion und Ausblick,oin operations but more data movements than other two algorithms and that the Min-Movement-Shifting algorithm requires fewer local join operations and data movements but more storage than the Min-Storage-Shifting algorithm.
发表于 2025-3-22 16:30:49 | 显示全部楼层
Spanning 2-trees,.655 when the graph is a complete Euclidean graph on a set of points in the plane. It is also shown that it is NP-complete to determine whether a graph admits a spanning 2-tree that contains a given spanning tree.
发表于 2025-3-22 18:10:27 | 显示全部楼层
Efficient equality-testing and updating of sets, have a scheme whose performance is in terms of . instead of ...This paper presents a new scheme which is more dynamic in nature and supports each insert or delete operation in O(log .) time, while maintaining the constant time complexity of set equality-testing.
发表于 2025-3-22 23:00:11 | 显示全部楼层
发表于 2025-3-23 02:27:51 | 显示全部楼层
Complexity as a basis for comparing semantic models of concurrency,etri-nets is exponentially larger than the relational representation within corresponding event structures. An application is a criterion for selection of semantic models for real-world algorithmic purposes; for example, ‘model checking’ algorithms which use an exponentially larger semantic representation of programs are unlikely to be efficient.
发表于 2025-3-23 08:44:46 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-9 18:34
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表